Sample-path Analysis of the Proportional Relation and Its Constant for Discrete-time Single-server Queues
نویسنده
چکیده
In the previous work, the authors have considered a discrete-time queueing system and they have established that, under some assumptions, the stationary queue length distribution for the system with capacity K1 is completely expressed in terms of the stationary distribution for the system with capacity K0 (> K1). In this paper, we study a sample-path version of this problem in more general setting, where neither stationarity nor ergodicity is assumed. We establish that, under some assumptions, the empirical queue length distribution (along through a sample path) for the system with capacity K1 is completely expressed only in terms of the quantities concerning the corresponding system with capacity K0 (> K1). Further, we consider a probabilistic setting where the assumptions are satisfied with probability one, and under the probabilistic setting, we obtain a stochastic version of our main result. The stochastic version is considered as a generalization of the author’s previous result, because the probabilistic assumptions are less restrictive.
منابع مشابه
A Unified Approach to the Proportional Relation for Discrete-time Single-server Queues
It is known that a simple relation called proportional relation holds for many queueing models, that is, the stationary queue-length distribution of one system can be expressed as the product of a constant and the distribution of another system which is different only in the buffer capacity. Recently, the proportional relation has been verified for various discretetime single-server queues with...
متن کاملA Unified Approach to the Proportional Relation for Discrete-Time Single-Server Queues Naoto Miyoshi, Fumio Ishizaki
It is well known that a simple relation called proportional relation holds for some queueing models, that is, the stationary queue length distribution of one system can be expressed as the product of a constant and the distribution of another system which is different only in the buffer capacity. Recently, the proportional relation has been verified for various discrete-time single-server queue...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملSample-path version of the unified approach to the proportional relation for discrete-time single-server queues
In [5], the authors have considered a discrete-time queueing system and they have established that, under some assumptions, the stationary queue length distribution for the system with capacity K1 is completely expressed in terms of the stationary distribution for the system with capacity K0 (> K1). In this paper, we study a sample-path version of this problem in more natural setting, where nei...
متن کاملDiscrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005